Paraconsistent Probabilities: Consistency, Contradictions and Bayes’ Theorem
نویسندگان
چکیده
منابع مشابه
Paraconsistent Probabilities: Consistency, Contradictions and Bayes' Theorem
This paper represents the first steps towards constructing a paraconsistent theory of probability based on the Logics of Formal Inconsistency (LFIs). We show that LFIs encode very naturally an extension of the notion of probability able to express sophisticated probabilistic reasoning under contradictions employing appropriate notions of conditional probability and paraconsistent updating, via ...
متن کاملParaconsistent set theory by predicating on consistency
This paper intends to contribute to the debate about the uses of paraconsistent reasoning in the foundations of set theory, by means of employing the logics of formal inconsistency (LFIs) and by considering consistent and inconsistent sentences, as well as consistent and inconsistent sets. We establish the basis for new paraconsistent set-theories (such as ZFmbC and ZFCil) under this perspectiv...
متن کاملBayes Factor Consistency
Good large sample performance is typically a minimum requirement of any model selection criterion. This article focuses on the consistency property of the Bayes factor, a commonly used model comparison tool, which has experienced a recent surge of attention in the literature. We thoroughly review existing results. As there exists such a wide variety of settings to be considered, e.g. parametric...
متن کاملFrequentist Consistency of Variational Bayes
A key challenge for modern Bayesian statistics is how to perform scalable inference of posterior distributions. To address this challenge, variational Bayes (vb) methods have emerged as a popular alternative to the classical Markov chain Monte Carlo (mcmc) methods. vb methods tend to be faster while achieving comparable predictive performance. However, there are few theoretical results around v...
متن کاملBayes-risk Consistency of Boosting
The probability of error of classification methods based on convex combinations of simple base classifiers by “boosting” algorithms is investigated. We show in this talk that certain regularized boosting algorithms provide Bayes-risk consistent classifiers under the only assumption that the Bayes classifier may be approximated by a convex combination of the base classifiers. Non-asymptotic dist...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2016
ISSN: 1099-4300
DOI: 10.3390/e18090325